#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n,h,m;
cin >> n >> h >> m;
int maxh[102];
for (int i = 1 ; i <= n; i++){
maxh[i] = h;
}
for (int i = 1; i <= m; i++){
int l,r,x;
cin >> l >> r >> x;
for (int j = l; j <= r; j++){
maxh[j] = min(maxh[j],x);
}
}
int ans = 0;
for (int i = 1; i <= n; i++){
ans+=maxh[i]*maxh[i];
}
cout << ans << endl;
}
1A - Theatre Square | 1614B - Divan and a New Project |
791A - Bear and Big Brother | 1452A - Robot Program |
344A - Magnets | 96A - Football |
702B - Powers of Two | 1036A - Function Height |
443A - Anton and Letters | 1478B - Nezzar and Lucky Number |
228A - Is your horseshoe on the other hoof | 122A - Lucky Division |
1611C - Polycarp Recovers the Permutation | 432A - Choosing Teams |
758A - Holiday Of Equality | 1650C - Weight of the System of Nested Segments |
1097A - Gennady and a Card Game | 248A - Cupboards |
1641A - Great Sequence | 1537A - Arithmetic Array |
1370A - Maximum GCD | 149A - Business trip |
34A - Reconnaissance 2 | 59A - Word |
462B - Appleman and Card Game | 1560C - Infinity Table |
1605C - Dominant Character | 1399A - Remove Smallest |
208A - Dubstep | 1581A - CQXYM Count Permutations |